Graph-Based Parsing
نویسنده
چکیده
The arc-factored model is the simplest graph-based model for dependency parsing, a model that factorizes the scoring function in terms of subgraphs of the dependency tree. The arc-factored model is often referred to as a first-order model, because it decomposes the score of a tree into the scores of one arc at a time. From a linguistic point of view, this is a rather drastic assumption, similar to but even more severe than the independence assumptions of a standard PCFG. Not surprisingly, research has therefore shown that higher parsing accuracy can be achieved by taking
منابع مشابه
An improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کاملGraph parsing with s-graph grammars
A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. computing all possible analyses of a given graph according to a grammar. This problem arises in training synchronous string-to-graph grammars, and when generating strings from them. We present two algorithms for graph parsing (bottom-up and top-down) with s-graph grammars. On the related problem o...
متن کاملPeking: Profiling Syntactic Tree Parsing Techniques for Semantic Graph Parsing
Using the SemEval-2014 Task 8 data, we profile the syntactic tree parsing techniques for semantic graph parsing. In particular, we implement different transitionbased and graph-based models, as well as a parser ensembler, and evaluate their effectiveness for semantic dependency parsing. Evaluation gauges how successful data-driven dependency graph parsing can be by applying existing techniques.
متن کاملAn Effective Neural Network Model for Graph-based Dependency Parsing
Most existing graph-based parsing models rely on millions of hand-crafted features, which limits their generalization ability and slows down the parsing speed. In this paper, we propose a general and effective Neural Network model for graph-based dependency parsing. Our model can automatically learn high-order feature combinations using only atomic features by exploiting a novel activation func...
متن کاملA Tale of Two Parsers: investigating and combining graph-based and transition-based dependency parsing using beam-search
Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both approaches under the framework of beamsearch. By developing a graph-based and a transition-based dependency parser, we show that a beam-search decoder is a competitive choice for both methods. More importantly, we propose ...
متن کاملA Tale of Two Parsers: Investigating and Combining Graph-based and Transition-based Dependency Parsing
Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both approaches under the framework of beamsearch. By developing a graph-based and a transition-based dependency parser, we show that a beam-search decoder is a competitive choice for both methods. More importantly, we propose ...
متن کامل